Reverse search for enumeration
نویسندگان
چکیده
منابع مشابه
Reverse Search for Enumeration
The reverse search technique has been recently introduced by the authors for eflicicnt enumeration of vertices of polyhedra and arrangements. In this paper, we develop this idea in a general framework and show its broader applications to various problems in operations research, combinatorics, and geometry. In particular. we propose new algorithms for listing (i) all triangulations of a set of n...
متن کاملComputational Experience with the Reverse Search Vertex Enumeration Algorithm
This paper describes computational experience obtained in the development of the lrs code, which uses the reverse search technique to solve the vertex enumeration/convex hull problem for d-dimensional convex polyhedra. We giv e empirical results showing improvements obtained by the use of lexicographic perturbation, lifting, and integer pivoting. We also give some indication of the cost of usin...
متن کاملSolution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts of a solution are needed. We are thus interested in projecting solutions to a restricted vocabulary. Yet, the adaption of Boolean constraint solving algorithms turns out to be non-obvious provided one wants a repetiti...
متن کاملlrs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm
This paper describes an improved implementation of the reverse search vertex enumeration/convex hull algorithm for d-dimensional convex polyhedra. The implementation uses a lexicographic ratio test to resolve degeneracy, works on bounded or unbounded polyhedra and uses exact arithmetic with all integer pivoting. It can also be used to compute the volume of the convex hull of a set of points. Fo...
متن کاملReverse search for monomial ideals
We give a set of multidegrees that support all the numerical information for a monomial ideal that can be reverse searched and hence is parallelizable and has space complexity that is polynomial in the size of the input. Our approach uses a new definition of closed sets for simplicial complexes that may be useful in other contexts.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00026-n